Editorial -"Judicious and educative"

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Emotion and the Educative Process

The material of the book consists of a report of a committee set up in 1931, and working since, ' to outline and conduct an exploratory study as to the recognition to be accorded emotional factors in the educational process, with special reference to the questions whether emotion has been unduly ignored in the stress laid upon the acquisition of knowledge. ; whether education should concern its...

متن کامل

Judicious partitions and related problems

Many classical partitioning problems in combinatorics ask for a single quantity to be maximized or minimized over a set of partitions of a combinatorial object. For instance, Max Cut asks for the largest bipartite subgraph of a graphG, while Min Bisection asks for the minimum size of a cut into two equal pieces. In judicious partitioning problems, we seek to maximize or minimize a number of qua...

متن کامل

Judicious Partitions of Hypergraphs

We prove the asymptotically best possible result that, for every integer k ≥ 2, every 3-uniform graph with m edges has a vertex-partition into k sets such that each set contains at most (1+o(1))m/k edges. We also consider related problems and conjecture a more general result.

متن کامل

Judicious partitions of graphs

The problem of finding good lower bounds on the size of the largest bipartite subgraph of a given graph has received a fair amount of attention. In particular, improving a result of Erdős ([10]; see also [11] for related problems), Edwards [9] proved the essentially best possible assertion that every graph with n vertices and m edges has a bipartite subgraph with at least m/2 + (n − 1)/4 edges....

متن کامل

Judicious k-partitions of graphs

Judicious partition problems ask for partitions of the vertex set of graphs so that several quantities are optimized simultaneously. In this paper, we answer the following judicious partition question of Bollobás and Scott [6] in the affirmative: For any positive integer k and for any graph G of size m, does there exist a partition of V (G) into V1, . . . , Vk such that the total number of edge...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Materials Research

سال: 2011

ISSN: 1516-1439

DOI: 10.1590/s1516-14392011000100001